Safest Path Adversarial Coverage: Proofs and Algorithm Details
نویسندگان
چکیده
Proof. Clearly, this problem is in NP, since one can easily guess the coverage path of the robot and then verify its probability of surviving it in polynomial time. To prove its NP-hardness, we use a reduction from the Hamiltonian path problem on grid graphs. A grid graph is a finite node-induced subgraph of the infinite two-dimensional integer grid (see Figure 1 for an example of a general grid graph). The Hamiltonian path problem on grid graphs (i.e., the construction of a path that visits every node of the grid graph precisely once) has been proven to be NP-complete in [2].
منابع مشابه
Application of A Route Expansion Algorithm for Transit Routes Design in Grid Networks
Establishing a network of transit routes with satisfactory demand coverage is one of the main goals of transitagencies in moving towards a sustainable urban development. A primary concern in obtaining such anetwork is reducing operational costs. This paper deals with the problem of minimizing construction costsin a grid transportation network while satisfying a certain level o...
متن کاملTowards safest path adversarial coverage
Coverage is a fundamental problem in robotics, where a robot is required to visit every part of a given area as efficiently as possible ([1], [3], [4], [5], [6], [8]). Coverage has many applications in various domains, from automatic floor cleaning to humanitarian missions such as search and rescue and field demining. The coverage problem is analogous to the traveling salesman problem (TSP), wh...
متن کاملDynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملTowards Efficient Robot Adversarial Coverage
This paper discusses the problem of generating efficient coverage paths for a mobile robot in an adversarial environment, where threats exist that might stop the robot. First, we formally define the problem of adversarial coverage, and present optimization criteria used for evaluation of coverage algorithms in adversarial environments. We then present a coverage area planning algorithm based on...
متن کامل